Tensor surgery and tensor rank
نویسندگان
چکیده
منابع مشابه
Efficient tensor completion: Low-rank tensor train
This paper proposes a novel formulation of the tensor completion problem to impute missing entries of data represented by tensors. The formulation is introduced in terms of tensor train (TT) rank which can effectively capture global information of tensors thanks to its construction by a wellbalanced matricization scheme. Two algorithms are proposed to solve the corresponding tensor completion p...
متن کاملLow-rank Tensor Approximation
Approximating a tensor by another of lower rank is in general an ill posed problem. Yet, this kind of approximation is mandatory in the presence of measurement errors or noise. We show how tools recently developed in compressed sensing can be used to solve this problem. More precisely, a minimal angle between the columns of loading matrices allows to restore both existence and uniqueness of the...
متن کاملExploring Tensor Rank
We consider the problem of tensor rank. We define tensor rank, discuss the motivations behind exploring the topic, and give some examples of the difficulties we face when trying to compute tensor rank. Some simpler lower and upper bounds for tensor rank are proven, and two techniques for giving lower bounds are explored. Finally we give one explicit example of a construction of an n×n×n tensors...
متن کاملTensor rank is not multiplicative under the tensor product
The tensor rank of a tensor t is the smallest number r such that t can be decomposed as a sum of r simple tensors. Let s be a k-tensor and let t be an `-tensor. The tensor product of s and t is a (k + `)-tensor. Tensor rank is sub-multiplicative under the tensor product. We revisit the connection between restrictions and degenerations. A result of our study is that tensor rank is not in general...
متن کاملTensor Regression Networks with various Low-Rank Tensor Approximations
Tensor regression networks achieve high rate of compression of model parameters in multilayer perceptrons (MLP) while having slight impact on performances. Tensor regression layer imposes low-rank constraints on the tensor regression layer which replaces the flattening operation of traditional MLP. We investigate tensor regression networks using various low-rank tensor approximations, aiming to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2018
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-018-0164-8